Q-Automata: Modelling the Resource Usage of Concurrent Components
نویسندگان
چکیده
منابع مشابه
Nominal Automata for Resource Usage Control
Two classes of nominal automata, namely Usage Automata (UAs) and Variable Finite Automata (VFAs) are considered to express resource control policies over program execution traces expressed by a nominal calculus (Usages). We first analyse closure properties of UAs, and then show UAs less expressive than VFAs. We finally carry over to VFAs the symbolic technique for model checking Usages against ...
متن کاملModelling Component Behaviour with Concurrent Automata
The effective (re)use of components requires languages for the precise description of observable behaviour, along with methods for checking the compatibility of component interfaces in a design. This is even more challenging in the presence of concurrency. In previous work we have considered a set-based model of components and their composition, in a concurrent setting. In this paper, we presen...
متن کاملResource Usage Modelling for Software Pipelining
In this paper we propose two optimization techniques for resource modelling in software pipelining. The first technique is the extension of our grouping technique to reduce the space overhead in automaton based software pipelining methods. This technique exploits the symmetry in the states of the automaton to produce the Group Automaton (GA) with reduced number of states. Our second technique i...
متن کاملConcurrent Logic and Automata Combined: A Semantics for Components
In this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent automata. Concurrent automata constitute a special kind of asynchronous transition system (ATS) used for modelling the behaviour of components as understood in component-based software development. Here, a componentbased system consists of several interacting components whereby each component manages cal...
متن کاملUsage Automata
Usage automata are an extension of finite stata automata, with some additional features (e.g. parameters and guards) that improve their expressivity. Usage automata are expressive enough to model security requirements of real-world applications; at the same time, they are simple enough to be statically amenable, e.g. they can be model-checked against abstractions of program usages. We study her...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.03.009